See Meyniel graph in All languages combined, or Wiktionary
{ "etymology_text": "Named after Henri Meyniel.", "forms": [ { "form": "Meyniel graphs", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Meyniel graph (plural Meyniel graphs)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "other", "langcode": "en", "name": "Graph theory", "orig": "en:Graph theory", "parents": [], "source": "w" } ], "glosses": [ "A graph in which every odd cycle of length five or more has at least two chords." ], "id": "en-Meyniel_graph-en-noun-kQApeqNW", "links": [ [ "graph theory", "graph theory" ], [ "graph", "graph" ], [ "odd", "odd" ], [ "cycle", "cycle" ], [ "length", "length" ], [ "chord", "chord" ] ], "raw_glosses": [ "(graph theory) A graph in which every odd cycle of length five or more has at least two chords." ], "related": [ { "word": "Meyniel's conjecture" } ], "topics": [ "graph-theory", "mathematics", "sciences" ] } ], "word": "Meyniel graph" }
{ "etymology_text": "Named after Henri Meyniel.", "forms": [ { "form": "Meyniel graphs", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Meyniel graph (plural Meyniel graphs)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "related": [ { "word": "Meyniel's conjecture" } ], "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English nouns", "Pages with 1 entry", "Pages with entries", "en:Graph theory" ], "glosses": [ "A graph in which every odd cycle of length five or more has at least two chords." ], "links": [ [ "graph theory", "graph theory" ], [ "graph", "graph" ], [ "odd", "odd" ], [ "cycle", "cycle" ], [ "length", "length" ], [ "chord", "chord" ] ], "raw_glosses": [ "(graph theory) A graph in which every odd cycle of length five or more has at least two chords." ], "topics": [ "graph-theory", "mathematics", "sciences" ] } ], "word": "Meyniel graph" }
Download raw JSONL data for Meyniel graph meaning in English (1.0kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-06-07 from the enwiktionary dump dated 2025-06-01 using wiktextract (92124b4 and f1c2b61). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.